Extremal Area of Polygons, sliding along a circle
نویسندگان
چکیده
We determine all critical configurations for the Area function on polygons with vertices a circle or an ellipse. For isolated points we compute their Morse index, resp index of gradient vector field. relate computation at degenerate point to eigenvalue question about combinations. In even dimensional case non-isolated singularities occur as ‘zigzag trains’.
منابع مشابه
Characterization of Extremal Antipodal Polygons
Let S be a set of 2n points on a circle such that for each point p ∈ S also its antipodal (mirrored with respect to the circle center) point p′ belongs to S. A polygon P of size n is called antipodal if it consists of precisely one point of each antipodal pair (p, p′) of S. We provide a complete characterization of antipodal polygons which maximize (minimize, respectively) the area among all an...
متن کاملExtremal problems for convex polygons
Consider a convex polygon Vn with n sides, perimeter Pn, diameter Dn, area An, sum of distances between vertices Sn and widthWn. Minimizing or maximizing any of these quantities while fixing another defines ten pairs of extremal polygon problems (one of which usually has a trivial solution or no solution at all). We survey research on these problems, which uses geometrical reasoning increasingl...
متن کاملExtremal antipodal polygons and polytopes
5 Let S be a set of 2n points on a circle such that for each point p ∈ S also its antipodal 6 (mirrored with respect to the circle center) point p′ belongs to S. A polygon P of size n is called 7 antipodal if it consists of precisely one point of each antipodal pair (p, p′) of S. 8 We provide a complete characterization of antipodal polygons which maximize (minimize, 9 respectively) the area am...
متن کاملDynamic circle separability between convex polygons
Let P, Q be two polygons of n and m vertices respectively. A circle containing P and whose interior does not intersect Q is called a separating circle. We propose an algorithm for finding the minimum separating circle between a fixed convex polygon P and query convex polygon Q. P and Q are given as ordered lists of vertices (sorted according to their order of appearance along the convex hulls o...
متن کاملOn Guarding Orthogonal Polygons with Sliding Cameras
A sliding camera inside an orthogonal polygon P is a point guard that travels back and forth along an orthogonal line segment γ in P . The sliding camera g can see a point p in P if the perpendicular from p onto γ is inside P . In this paper, we give the first constant-factor approximation algorithm for the problem of guarding P with the minimum number of sliding cameras. Next, we show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hokkaido Mathematical Journal
سال: 2022
ISSN: ['0385-4035']
DOI: https://doi.org/10.14492/hokmj/2020-312